Verified Density Compilation for a Probabilistic Programming Language
نویسندگان
چکیده
This paper presents ProbCompCert, a compiler for subset of the Stan probabilistic programming language (PPL), in which several key passes have been formally verified using Coq proof assistant. Because nature PPLs, bugs their compilers can be difficult to detect and fix, making verification an interesting possibility. However, proving correctness PPL compilation requires new techniques because certain transformations performed by PPLs are quite different from other kinds languages. describes verifying such application ProbCompCert. In course we found error reference manual related semantics implementation construct.
منابع مشابه
A Compilation Target for Probabilistic Programming Languages
Forward inference techniques such as sequential Monte Carlo and particle Markov chain Monte Carlo for probabilistic programming can be implemented in any programming language by creative use of standardized operating system functionality including processes, forking, mutexes, and shared memory. Exploiting this we have defined, developed, and tested a probabilistic programming language intermedi...
متن کاملVerified type checker for Jolie programming language
Jolie is a service-oriented programming language which comes with the formal specication of its type system. However, there is no tool to ensure that programs in Jolie are well-typed. In this paper we provide the results of building a type checker for Jolie as a part of its syntax and semantics formal model. We express the type checker as a program with dependent types in Agda proof assistant w...
متن کاملA Formally Verified Interpreter for a Shell-Like Programming Language
The shell language is widely used for various system administration tasks on UNIX machines, as for instance as part of the installation process of software packages in FOSS distributions. Our mid-term goal is to analyze these scripts as part of an ongoing effort to use formal methods for the quality assurance of software distributions, to prove their correctness, or to pinpoint bugs. However, t...
متن کاملInference Compilation and Universal Probabilistic Programming
We introduce a method for using deep neural networks to amortize the cost of inference in models from the family induced by universal probabilistic programming languages, establishing a framework that combines the strengths of probabilistic programming and deep learning methods. We call what we do “compilation of inference” because our method transforms a denotational specification of an infere...
متن کاملA Programming Language for Probabilistic Computation
As probabilistic computations play an increasing role in solving various problems, researchers have designed probabilistic languages to facilitate their modeling. Most of the existing probabilistic languages, however, focus only on discrete distributions, and there has been little effort to develop probabilistic languages whose expressive power is beyond discrete distributions. This dissertatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ACM on programming languages
سال: 2023
ISSN: ['2475-1421']
DOI: https://doi.org/10.1145/3591245